A Simple construction of the Pseudorandom Generator from Permutation
نویسنده
چکیده
A simple construction of pseudorandom generator is appear.This pseudorandom generator is always passed by NIST statistical test.This paper reports a pseudorandom number generator which has good property is able to construct using only permutation and data rewriting by XOR.
منابع مشابه
Limitations of the Even-Mansour Construction
In [1] a construction of a block cipher from a single pseudorandom permutation is proposed. In a complexity theoretical setting they prove that this scheme is secure against a polynomially bounded adversary. In this paper it is shown that this construction suffers from severe limitations that are immediately apparent if differential cryptanalysis [3] is performed. The fact that these limitation...
متن کاملLarge Families of Pseudorandom Subsets Formed by Power Residues
In an earlier paper the authors introduced the measures of pseudorandomness of subsets of the set of the positive integers not exceeding N , and they also presented two examples for subsets possessing strong pseudorandom properties. One of these examples included permutation polynomials f(X) ∈ Fp[X] and d-powers in Fp. This construction is not of much practical use since very little is known on...
متن کاملA Simpliied and Generalized Treatment of Luby-rackoo Pseudorandom Permutation Generators
A paper by Luby and Rackoo on the construction of pseudoran-dom permutations from pseudorandom functions based on a design principle of the DES has recently initiated a burst of research activities on applications and generalizations of these results. This paper presents a strongly simpliied treatment of these results and generalizes them by pointing out the relation to locally random functions...
متن کاملA Generic Method to Extend Message Space of a Strong Pseudorandom Permutation
In this paper we present an efficient and secure generic method which can encrypt messages of size at least n. This generic encryption algorithm needs a secure encryption algorithm for messages of multiple of n. The first generic construction, XLS, has been proposed by Ristenpart and Rogaway in FSE-07. It needs two extra invocations of an independently chosen strong pseudorandom permutation or ...
متن کاملOn the XOR of Multiple Random Permutations
A straightforward way of constructing an n-bit pseudorandom function is to XOR two or more pseudorandom permutations: p1 ⊕ . . .⊕pk. This XOR construction has gained broad attention over the last two decades. In this work, we revisit the security of this well-established construction. We consider the case where the underlying permutations are considered secret, as well as the case where these p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1412.5619 شماره
صفحات -
تاریخ انتشار 2014